Verifiable Oblivious Storage
نویسندگان
چکیده
We formalize the notion of Verifiable Oblivious Storage (VOS), where a client outsourcesthe storage of data to a server while ensuring data confidentiality, access pattern privacy, andintegrity and freshness of data accesses. VOS generalizes the notion of Oblivious RAM (ORAM)in that it allows the server to perform computation, and also explicitly considers data integrityand freshness.We show that allowing server-side computation enables us to construct asymptotically moreefficient VOS schemes whose bandwidth overhead cannot be matched by any ORAM scheme,due to a known lower bound by Goldreich and Ostrovsky. Specifically, for large block sizeswe can construct a VOS scheme with constant bandwidth per query; further, answering queriesrequires only poly-logarithmic server computation. We describe applications of VOS to DynamicProofs of Retrievability, and RAM-model secure multi-party computation.
منابع مشابه
Verifiable Homomorphic Oblivious Transfer and Private Equality Test
We describe slightly modified version (that we call the HOT protocol) of the Aiello-Ishai-Reingold oblivious transfer protocol from Eurocrypt 2001. In particular, the HOT protocol will be what we call weakly secure when coupled with many different homomorphic semantically secure public-key cryptosystems. Based on the HOT protocol, we construct an efficient verifiable oblivious transfer protocol...
متن کاملGeneralizing Efficient Multiparty Computation
We focus on generalizing constructions of Batch Single-Choice Cut-And-Choose Oblivious Transfer and Multi-sender k-out-of-n Oblivious Transfer, which are at the core of efficient secure computation constructions proposed by Lindell et al. and the IPS compiler. Our approach consists in showing that such primitives can be based on a much weaker and simpler primitive called Verifiable Oblivious Tr...
متن کاملVerifiable quantum oblivious transfer protocol based on entangled states
We describe an efficient protocol for verifiable quantum oblivious transfer. The protocol, which can be implemented with present technology, is secure against cheaters with unlimited computing power and with the ability to store the particles for an arbitrarily long period of time. The protocol is based on the following two entangled states: |Φ〉 = 1 √ 2 (|↑↑〉+ |↓ x〉) and |Ψ〉 = 1 √ 2 (|↑↑〉+ |↓ −...
متن کاملSecure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment
In this paper, we have discussed the issues concerning the basic concept and classification of OT (Oblivious Transfer). We have proposed secure verifiable non-interactive oblivious transfer protocols for the exchange of secrets on distributed environments. One is a new secure verifiable noninteractive oblivious transfer protocol using RSA, the other is that with bit commitment using one-way fun...
متن کاملEfficient Verifiable Computation of XOR for Biometric Authentication
This work addresses the security and privacy issues in remote biometric authentication by proposing an efficient mechanism to verify the correctness of the outsourced computation in such protocols. In particular, we propose an efficient verifiable computation of XORing encrypted messages using an XOR linear message authentication code (MAC) and we employ the proposed scheme to build a biometric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014